71 research outputs found

    A note on the existence of {k, k}-equivelar polyhedral maps

    Full text link
    A polyhedral map is called {p,q}\{p, q\}-equivelar if each face has pp edges and each vertex belongs to qq faces. In 1983, it was shown that there exist infinitely many geometrically realizable {p,q}\{p, q\}-equivelar polyhedral maps if q>p=4q > p = 4, p>q=4p > q = 4 or q3>p=3q - 3 > p = 3. It was shown in 2001 that there exist infinitely many {4,4}\{4, 4\}- and {3,6}\{3, 6\}-equivelar polyhedral maps. In 1990, it was shown that {5,5}\{5, 5\}- and {6,6}\{6, 6\}-equivelar polyhedral maps exist. In this note, examples are constructed, to show that infinitely many self dual {k,k}\{k, k\}-equivelar polyhedral maps exist for each k5k \geq 5. Also vertex-minimal non-singular {p,p}\{p, p\}-pattern are constructed for all odd primes pp.Comment: 7 pages. To appear in `Contributions to Algebra and Geometry

    Minimal Triangulations of Manifolds

    Full text link
    In this survey article, we are interested on minimal triangulations of closed pl manifolds. We present a brief survey on the works done in last 25 years on the following: (i) Finding the minimal number of vertices required to triangulate a given pl manifold. (ii) Given positive integers nn and dd, construction of nn-vertex triangulations of different dd-dimensional pl manifolds. (iii) Classifications of all the triangulations of a given pl manifold with same number of vertices. In Section 1, we have given all the definitions which are required for the remaining part of this article. In Section 2, we have presented a very brief history of triangulations of manifolds. In Section 3, we have presented examples of several vertex-minimal triangulations. In Section 4, we have presented some interesting results on triangulations of manifolds. In particular, we have stated the Lower Bound Theorem and the Upper Bound Theorem. In Section 5, we have stated several results on minimal triangulations without proofs. Proofs are available in the references mentioned there.Comment: Survey article, 29 page

    On stacked triangulated manifolds

    Full text link
    We prove two results on stacked triangulated manifolds in this paper: (a) every stacked triangulation of a connected manifold with or without boundary is obtained from a simplex or the boundary of a simplex by certain combinatorial operations; (b) in dimension d4d \geq 4, if Δ\Delta is a tight connected closed homology dd-manifold whose iith homology vanishes for 1<i<d11 < i < d-1, then Δ\Delta is a stacked triangulation of a manifold.These results give affirmative answers to questions posed by Novik and Swartz and by Effenberger.Comment: 11 pages, minor changes in the organization of the paper, add information about recent result

    On kk-stellated and kk-stacked spheres

    Full text link
    We introduce the class Σk(d)\Sigma_k(d) of kk-stellated (combinatorial) spheres of dimension dd (0kd+10 \leq k \leq d + 1) and compare and contrast it with the class Sk(d){\cal S}_k(d) (0kd0 \leq k \leq d) of kk-stacked homology dd-spheres. We have Σ1(d)=S1(d)\Sigma_1(d) = {\cal S}_1(d), and Σk(d)Sk(d)\Sigma_k(d) \subseteq {\cal S}_k(d) for d2k1d \geq 2k - 1. However, for each k2k \geq 2 there are kk-stacked spheres which are not kk-stellated. The existence of kk-stellated spheres which are not kk-stacked remains an open question. We also consider the class Wk(d){\cal W}_k(d) (and Kk(d){\cal K}_k(d)) of simplicial complexes all whose vertex-links belong to Σk(d1)\Sigma_k(d - 1) (respectively, Sk(d1){\cal S}_k(d - 1)). Thus, Wk(d)Kk(d){\cal W}_k(d) \subseteq {\cal K}_k(d) for d2kd \geq 2k, while W1(d)=K1(d){\cal W}_1(d) = {\cal K}_1(d). Let Kˉk(d)\bar{{\cal K}}_k(d) denote the class of dd-dimensional complexes all whose vertex-links are kk-stacked balls. We show that for d2k+2d\geq 2k + 2, there is a natural bijection MMˉM \mapsto \bar{M} from Kk(d){\cal K}_k(d) onto Kˉk(d+1)\bar{{\cal K}}_k(d + 1) which is the inverse to the boundary map  ⁣:Kˉk(d+1)Kk(d)\partial \colon \bar{{\cal K}}_k(d + 1) \to {\cal K}_k(d).Comment: Revised Version. Theorem 2.24 is new. 18 pages. arXiv admin note: substantial text overlap with arXiv:1102.085

    Minimal triangulations of sphere bundles over the circle

    Full text link
    For integers d2d \geq 2 and ϵ=0\epsilon = 0 or 1, let S1,d1(ϵ)S^{1, d - 1}(\epsilon) denote the sphere product S1×Sd1S^{1} \times S^{d - 1} if ϵ=0\epsilon = 0 and the twisted Sd1S^{d - 1} bundle over S1S^{1} if ϵ=1\epsilon = 1. The main results of this paper are: (a) if dϵd \equiv \epsilon (mod 2) then S1,d1(ϵ)S^{1, d - 1}(\epsilon) has a unique minimal triangulation using 2d+32d + 3 vertices, and (b) if d1ϵd \equiv 1 - \epsilon (mod 2) then S1,d1(ϵ)S^{1, d - 1}(\epsilon) has minimal triangulations (not unique) using 2d+42d + 4 vertices. The second result confirms a recent conjecture of Lutz. The first result provides the first known infinite family of closed manifolds (other than spheres) for which the minimal triangulation is unique. Actually, we show that while S1,d1(ϵ)S^{1, d - 1}(\epsilon) has at most one (2d+3)(2d + 3)-vertex triangulation (one if dϵd \equiv \epsilon (mod 2), zero otherwise), in sharp contrast, the number of non-isomorphic (2d+4)(2d + 4)-vertex triangulations of these dd-manifolds grows exponentially with dd for either choice of ϵ\epsilon. The result in (a), as well as the minimality part in (b), is a consequence of the following result: (c) for d3d \geq 3, there is a unique (2d+3)(2d + 3)-vertex simplicial complex which triangulates a non-simply connected closed manifold of dimension dd. This amazing simplicial complex was first constructed by K\"{u}hnel in 1986. Generalizing a 1987 result of Brehm and K\"{u}hnel, we prove that (d) any triangulation of a non-simply connected closed dd-manifold requires at least 2d+32d + 3 vertices. The result (c) completely describes the case of equality in (d). The proofs rest on the Lower Bound Theorem for normal pseudomanifolds and on a combinatorial version of Alexander duality.Comment: 15 pages, Revised, To appear in `Journal of Combinatorial Theory, Ser. A
    corecore